The computational nature of routine design problems
نویسنده
چکیده
In this paper, we make an investigation into the structure of routine design problems. By analyzing the design problem solving process, we show that the designer acquires a special kind of design knowledge, which we called path variability knowledge. Based on this kind of knowledge, we conclude that routine design can be regarded as a class of well-structured problems. Therefore, contrary to the prevailing view that regards routine design problems as search problems, we argue that within a chosen domain of variation they may be solved by direct algorithmic methods.
منابع مشابه
Development of PSPO Simulation Optimization Algorithm
In this article a new algorithm is developed for optimizing computationally expensive simulation models. The optimization algorithm is developed for continues unconstrained single output simulation models. The algorithm is developed using two simulation optimization routines. We employed the nested partitioning (NP) routine for concentrating the search efforts in the regions which are most like...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملEvaluating the effectiveness of teaching nature-based strategies on the Bioarchitecture design process
Introduction: At a time when modern rational man saw himself as the source of all values and saw nature as an inexhaustible source of raw materials for the development of industry and the satisfaction of his needs, architecture became a tool for meeting the physical and material needs of man. The spread of this thinking led to many problems, including environmental crises; In order to improve...
متن کاملRoutine Creativity
It is common wisdom that people should be given tasks that computers can’t do well, and computers should be given tasks that people can’t do well. So in design computing why are we attempting to study computational design creativity? The main answer is that the field (like many others) progresses by tackling simpler problems first and moving towards harder ones. Routine parametric design and de...
متن کاملIMPROVING COMPUTATIONAL EFFICIENCY OF PARTICLE SWARM OPTIMIZATION FOR OPTIMAL STRUCTURAL DESIGN
This paper attempts to improve the computational efficiency of the well known particle swarm optimization (PSO) algorithm for tackling discrete sizing optimization problems of steel frame structures. It is generally known that, in structural design optimization applications, PSO entails enormously time-consuming structural analyses to locate an optimum solution. Hence, in the present study it i...
متن کامل